Apparatus and method for the recovery of compression constants in the encoded domain

ABSTRACT

The system and method of the present invention provides an innovative technique and efficient hardware structure for recovering lost or damaged (lost/damaged) compression constants in the encoded domain. In one embodiment, a lost/damaged compression constant is recovered by estimating a compression constant of the block using encoded data of at least one neighboring block of data and other recoverable compression constants of the block.

RELATED APPLICATIONS

[0001] This application is a continuation-in-part of U.S. patent application Ser. No.: 09/249,596, filed Feb. 12, 1999, titled “Apparatus and Method for the Recovery of Compression Constants in the Encoded Domain”.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates to the recovery of data. More particularly, the present invention relates to the recovery of lost/damaged block data in a bitstream of compressed data.

[0004] 2. Art Background

[0005] It is often desirable to compress data, such as video images or sound data, for transmission and storage. Typically, when data is compressed, compression constants are generated. In some instances block-wide data is generated. These constants are transmitted or stored along with the compressed image. Problems can arise if the compression constants are lost or damaged prior to decompression of the data. As an illustration, the discussion below illustrates the problems that arise if image data compression constants are lost.

[0006] The discrete data points that make up a digital image are known as pixels. Typically, each pixel is represented independently using 8 bits, but other representations also are used for the purposes of compression or analysis. Most of the alternative representations begin by dividing this raw data into disjoint sets. For historical reasons, these sets are referred to as “blocks”, even though they may not have a traditional block shape. The alternative representation then characterizes the data by some block-wide information and per-pixel information.

[0007] Examples of block-wide information include the minimum pixel value (MIN), the maximum pixel value (MAX), and the dynamic range of the pixel values (DR), where DR=MAX−MIN or DR=1+MAX−MIN. Per-pixel information may indicate where the pixel value lies within the range specified by the global information. For compression to be achieved, the per-pixel information must use only a few bits of storage so that the total number of bits used is less than that required to store the raw image.

[0008] In one example, the block data is comprised of the MIN, DR and Qbit number (defined below), and the pixel data is comprised of Q codes. A Q code is a Qbit number that can be an integer in the range [0, 2^(Q)−1] that identifies one value in the set {MIN, MIN+1, . . . ,MAX}. Since the Qbit number is generally small and the DR value may be relatively large, it is generally not possible to represent all pixel values exactly. Therefore, some quantization error is introduced when pixel values are reduced to Q code values. For instance, if the Qbit number is 3, then it is generally possible to represent 2³=8 values from the set {MIN, MIN+1, . . . ,MAX} without any error. Pixels with other values are rounded to one of these eight values. This rounding introduces quantization error.

[0009] If any of the block information, e.g., MIN, MAX or DR, is lost, the damage to the image is potentially large as many pixels are affected. For this reason, it is desirable to have techniques for accurately estimating or recovering the values of this lost data.

[0010] Recovery methods fall into two categories: decoded domain, and encoded domain. Decoded domain techniques restore portions of the image to its raw data format and then exploit local correlation properties to estimate the missing data. Data recovery, including compression constants, may be performed in the decoded domain. However, additional computation and time, and therefore additional expense, is required to perform and evaluate decodings.

SUMMARY OF THE INVENTION

[0011] The system and method of the present invention provides an innovative technique for recovering lost or damaged (lost/damaged) compression constants of a block in the encoded domain. In one embodiment, a lost/damaged compression constant is recovered by estimating a compression constant of the block using encoded data of at least one neighboring block of data and other recoverable compression constants of the block and neighboring block. For example, in one embodiment wherein the encoded data comprises image data, each block of data consists of dynamic range (DR) and Minimum (MIN) constants, where DR=MAX−MIN and MAX represents a maximum data value in the block.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012] The objects, features and advantages of the present invention will be apparent from the following detailed description in which:

[0013]FIG. 1 illustrates one embodiment of the method of the present invention.

[0014]FIG. 2 illustrates an alternate embodiment of the method of the present invention.

[0015]FIG. 3a illustrates one embodiment of the system of the present invention, and FIG. 3b illustrates another embodiment of the system of the present invention.

DETAILED DESCRIPTION

[0016] In the following description, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that these specific details are not required in order to practice the present invention. In other instances, well known electrical structures and circuits are shown in block diagram form in order not to obscure the present invention unnecessarily.

[0017] The following is described in the context of Adaptive Dynamic Range Coding (ADRC) encoded images, and more particularly to the recovery of lost or damaged (lost/damaged) compression constants such as dynamic range (DR) and Minimum value (MIN). However, it is contemplated that the present invention is not limited to ADRC encoding and the particular compression constants generated; rather it will be apparent that the present invention is applicable to different compression technologies, different types of data, including, but not limited to, sound data and the like, and different compression constants including, but not limited to, the Maximum value (MAX) which may be used in ADRC processes. In addition, the present invention is applicable to different types of ADRC processes including edge-matching and non edge-matching ADRC. For further information regarding ADRC, see, “Adaptive Dynamic Range Coding Scheme for Future HDTV Digital VTR”, Kondo, Fujimori, Nakaya, Fourth International Workshop on HDTV and Beyond, Sep. 4-6, 1991, Turin, Italy.

[0018]FIG. 1 is illustrative of one embodiment of a method for recovery lost/damaged compression constants in accordance with the teachings of the present invention. In this embodiment, certain information, such as the information which identifies the placement of the encoded data in the bitstream is known. However, at least one of the compression constants which are utilized to decode the encoded data is lost or damaged (lost/damaged). In one example in which the data is encoded using ADRC, the present method can be used to recover lost/damaged compression constants such as DR, MAX or MIN. Typically two of these constants, e.g., DR and MIN, are used to decode the encoded data, e.g., Q codes, received in the bitstream. In another embodiment, CEN and DR are used to decode the decoded data. CEN is a central value within the dynamic range. In one embodiment CEN may be set to MIN+DR/2.

[0019] Referring to FIG. 1, at step 105, encoded data of at least one neighboring block, encoded data of the block with the lost/damaged compression constant, and any previous recovered compression constants of the block and neighboring block are received as input. At step 110, the lost/damaged compression constant is estimated using the neighboring encoded data, encoded data of the block and any previous recovered compression constants of the block and the neighboring block.

[0020] A significant time and cost savings is achieved by using the encoded data of the block and the neighboring block as it is not necessary to go through one or more iterations of a costly decoding process before determining the lost/damaged compression constant.

[0021] Continuing with the present example which uses MIN and DR to decode the Q codes, if the MIN value is lost/damaged, the DR value and Q codes of the block and the DR, MIN and Q codes of the neighboring block are used to estimate the MIN value using encoded data.

[0022] MIN may be estimated as the value that minimizes an average difference between decoded values from the block and corresponding decoded values from at least one neighboring block. The average function can be a weighted average of neighboring values, for example, the values may be weighted relative to the location of the neighboring block with respect to the block of interest. In one embodiment, MIN may be estimated using a least squares estimation. For example, MIN may be determined as follows:

[0023] Non edge-matching ADRC: ${MIN} = \frac{{2^{Q + Q^{\prime} + 1} \cdot N \cdot {MIN}^{\prime}} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}$

[0024] Edge-matching ADRC: ${MIN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {MIN}^{\prime}} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}$

[0025] where N represents a number of neighboring encoded data to use, MIN′ represents the MIN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data, such as the encoded data, of the neighboring block.

[0026] If the DR value is lost/damaged, the MIN value and Q codes of the block and the DR, MIN and Q codes of the neighboring block are used to estimate DR.

[0027] In one embodiment, DR may be estimated using a least squares estimation. For example:

[0028] an integer formula for non edge-matching ADRC: ${DR} = \frac{{2^{Q + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right) \cdot {\sum\limits_{i = 1}^{N}\left( {{2e_{i}} + 1} \right)}} + {2^{Q - Q^{\prime}} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}{\left( {{2e_{i}^{\prime}} + 1} \right) \cdot \left( {{2e_{i}} + 1} \right)}}}}{\sum\limits_{i = 1}^{N}\left( {{2e_{i}} + 1} \right)^{2}}$

[0029] an integer formula for edge-matching ADRC: ${DR} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {MIN}^{\prime}} - {2 \cdot {MIN}} + 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {e_{i}^{\prime} \cdot e_{i}} \right)}}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left( e_{i} \right)^{2}}}$

[0030] where N represents a number of neighboring encoded data to use, MIN and MIN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.

[0031] In another embodiment, an alternate recovery formula may be used. DR may be estimated as the value that makes the sum of decoded values of the block equal to the sum of the decoded values of the neighboring block. For example, DR is determined according to the following equation:

[0032] Non edge-matching ADRC: ${DR} = \frac{2^{Q} \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot \left( {{2 \cdot e_{i}^{\prime}} + 1} \right)} + {2^{Q^{\prime} + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{2^{Q^{\prime}} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}$

[0033] Edge-matching ADRC: ${DR} = \frac{\left( {2^{Q} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot e_{i}^{\prime}} + {\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{\left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}}$

[0034] where N represents a number of neighboring encoded data to use, MIN and MIN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.

[0035] If CEN and DR are used to decode the Q codes, and the CEN value is lost/damaged, the DR value and Q codes of the block and the DR, CEN and Q codes of the neighboring block are used to estimate the CEN value using encoded data.

[0036] CEN may be estimated as the value that minimizes an average difference between decoded values from the block and corresponding decoded values from at least one neighboring block. In one embodiment, CEN may be estimated using a least squares estimation. For example, CEN may be determined as follows:

[0037] Non edge-matching ADRC: ${CEN} = \frac{{2^{Q + Q^{\prime}} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime}} \right)} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}$

[0038] Edge-matching ADRC: ${CEN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}$

[0039] where N represents a number of neighboring encoded data to use, CEN′ represents the CEN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data, such as the encoded data, of the neighboring block.

[0040] If the DR value is lost/damaged, the CEN value and Q codes of the block and the DR, CEN and Q codes of the neighboring block are used to estimate DR.

[0041] In one embodiment, DR may be estimated using a least squares estimation. For example:

[0042] an integer formula for non edge-matching ADRC: ${DR} = \frac{{2^{Q} \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime}} \right) \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}} + {2^{Q - Q^{\prime}} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}{\left( {{2 \cdot e_{i}^{\prime}} + 1} \right) \cdot \left( {{2 \cdot e_{i}} + 1} \right)}}}}{\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)^{2}}$

[0043] an integer formula for edge-matching ADRC: ${DR} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime} + 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {e_{i}^{\prime} \cdot e_{i}} \right)}}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left( e_{i} \right)^{2}}}$

[0044] where N represents a number of neighboring encoded data to use, CEN and CEN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.

[0045] In another embodiment, an alternate recovery formula may be used. DR may be estimated as the value that makes the sum of decoded values of the block equal to the sum of the decoded values of the neighboring block. For example, DR is determined according to the following equation:

[0046] Non edge-matching ADRC: ${DR} = \frac{2^{Q} \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot \left( {{2e_{i}^{\prime}} + 1} \right)} + {2^{Q^{\prime}} \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime}} \right)}} \right\rbrack}}{2^{Q^{\prime}} \cdot {\sum\limits_{i = 1}^{N}\left( {{2e_{i}} + 1} \right)}}$

[0047] Edge-matching ADRC: ${DR} = \frac{\left( {2^{Q} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{2 \cdot {DR}^{\prime} \cdot e_{i}^{\prime}} + {\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime}} \right)}} \right\rbrack}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}}$

[0048] where N represents a number of neighboring encoded data to use, CEN and CEN′ respectively represent the CEN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.

[0049] Other embodiments are also contemplated. For example, if MIN and MAX are used as compression constants, and one of them is damaged, DR is estimated and the compression constant is computed from the estimated DR. Furthermore, if MAX and DR are used, processing similar to MIN and DR described herein is used. Furthermore, other constants specifically not identified herein may be used. It is contemplated that other constant levels may function similar to MIN and appropriate equations would be derived therefrom.

[0050] In an alternate embodiment, variables used to determine other compression constants are also used to determine other compression constants discussed herein. For example, for data encoded using ADRC, the Qbit and motion flag values utilize the following variables: $X = {\sum\limits_{i = 1}^{N}e_{i}}$ $Y = {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}$

[0051] where e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block. As a large percentage of the hardware is devoted to computing the above sums (because the sums may be taken over N usable neighboring relations), the complexity of MIN and DR estimation circuits may be greatly reduced by inputting X and Y values where applicable. Thus, in one embodiment, for example, using X and Y, MIN and DR may be determined as follows:

[0052] Non edge-matching ADRC: ${MIN} = \frac{{2^{Q + Q^{\prime} - 1} \cdot N \cdot {MIN}^{\prime}} + {2^{Q - 2} \cdot {DR}^{\prime} \cdot \left( {{2 \cdot Y} + N} \right)} - {2^{Q^{\prime} - 2} \cdot {DR} \cdot \left( {{2 \cdot X} + N} \right)}}{2^{Q + Q^{\prime} - 1} \cdot N}$

${DR} = \frac{2^{Q} \cdot \left\lbrack {{2^{Q^{\prime} + 1} \cdot N \cdot \left( {{MIN}^{\prime} - {MIN}} \right)} + {{DR}^{\prime} \cdot \left( {{2 \cdot Y} + N} \right)}} \right\rbrack}{2^{Q^{\prime}} \cdot \left( {{2 \cdot X} + N} \right)}$

[0053] Edge-matching ADRC: ${MIN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {MIN}^{\prime}} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot Y} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot X}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}$ ${DR} = \frac{\left( {2^{Q} - 1} \right) \cdot \left\lbrack {{\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{MIN}^{\prime} - {MIN}} \right)} + {{DR}^{\prime} \cdot Y}} \right\rbrack}{\left( {2^{Q^{\prime}} - 1} \right) \cdot X}$

[0054] where N represents the number of neighboring data, Q and Q′ respectively represent the Q bit number of the block and the neighboring block, MIN′ represents the MIN value of the neighboring block, DR and DR′ respectively represent the DR of the block and neighboring block.

[0055] In an alternate embodiment, using X and Y, CEN and DR may be determined as follows:

[0056] Non edge-matching ADRC: ${CEN} = \frac{{2^{Q + Q^{\prime} - 2} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime}} \right)} + {2^{Q - 2} \cdot {DR}^{\prime} \cdot \left( {{2 \cdot Y} + N} \right)} - {2^{Q^{\prime} - 2} \cdot {DR} \cdot \left( {{2 \cdot X} + N} \right)}}{2^{Q + Q^{\prime} - 1} \cdot N}$ ${DR} = \frac{2^{Q} \cdot \left\lbrack {{2^{Q^{\prime}} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime}} \right)} + {{DR}^{\prime} \cdot \left( {{2 \cdot Y} + N} \right)}} \right\rbrack}{2^{Q^{\prime}} \cdot \left( {{2 \cdot X} + N} \right)}$

[0057] Edge-Matching ADRC: ${CEN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot Y} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot X}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}$ ${DR} = \frac{\left( {2^{Q} - 1} \right) \cdot \left\lbrack {{\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {CEN}^{\prime}} - {2 \cdot {CEN}} + {DR} - {DR}^{\prime}} \right)} + {2 \cdot {DR}^{\prime} \cdot Y}} \right\rbrack}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot X}$

[0058] In the present embodiments, the numerator may be clipped such that n=max(0,n).

[0059] The numerator and denominator of the above equations may be large (e.g. 24 bits), thus, a general purpose divider to accommodate a range of values would require much hardware. It has been determined that certain efficiencies can be realized without compromising on the effectiveness of the results. As the allowed ranges of the compression values (e.g. MIN and DR) are restricted to certain ranges (e.g. 0-255 for one implementation), only a low precision (e.g. 8 bit) is required. It has also been determined that leading zeros can be eliminated without changing the accuracy of the result and the least significant bit can be truncated with only a minor effect on the result.

[0060] Thus, an alternate embodiment is described with reference to FIG. 2. In this embodiment, the steps can be performed quickly in hardware logic. As noted above the equations require a division operation to be performed; therefore, a numerator and denominator of the quotient will be referred to in the following discussion.

[0061] At step 205, the numerator of one of the above formulae is computed using full precision. At step 210, the denominator is computed using full precision. At step 215, the numerator and denominator are reduced by shifting off the least significant bit until both are at least K-bits in length (i.e., until K-bits or less in length). In the present embodiment, the numerator and denominator are shifted the same number of bits. However, in alternate embodiments, the numerator and denominator maybe shifted a different number of bits. In such an embodiment, compensation would be made elsewhere for the bit-shift differential.

[0062] Thus, in the present embodiment, while (n≧2^(K) or d≧2^(K)), then

[0063] n/2 (shift off LSB)

[0064] d/2 (shift off LSB)

[0065] where n represents the value of the numerator and d represents the value of the denominator.

[0066] A value of K is selected such that integer division can be performed using cost efficient logic while maintaining an acceptable image quality. In one embodiment, K is selected such that the maximum error is not visually detectable, e.g., the maximum error is not greater than 3%. In the present embodiment in which an 8 bit encoding is used, K is selected to be 13.

[0067] At step 230, the value is clipped for consistency with the auxiliary information available, for example other available compression constants. In the present example, the value is clipped to satisfy the allowable range of values. For example, for 8 bit ADRC:

[0068] non edge-matching ADRC:

MIN+DR≦254

CEN+DR/2≦254

[0069] edge-matching ADRC:

MIN+DR≦255

CEN+DR/2≦255

[0070] One embodiment of the system of the present invention is illustrated in FIG. 3a. FIG. 3a is a simplified functional block diagram of estimator circuitry that may be utilized to implement the processes described herein. For example, the circuitry may be implemented in specially configured logic, such as large scale integration (LSI) logic or programmable gate arrays. Alternately, as is illustrated in FIG. 3b, the circuitry may be implemented as code executed by a dedicated, specially configured or general purpose processor, which executes instructions stored in a memory or other storage device. Furthermore, the present invention may be implemented as a combination of the above.

[0071] Referring to FIG. 3a, numerator logic 310 determines the full precision value of the numerator portion of the computation performed to estimate a lost/damaged compression constant in the encoded domain. Denominator logic 320 similarly determines a full precision value of the denominator portion of the computation. In one embodiment, K-bit shift registers (not shown) shift out the least significant bits of the values generated by logic 310, 320 until the numerator and denominator are each K-bits in length. Alternately, the shift operation may be performed by computation logic 350. As described earlier, K is chosen, for example, empirically, such that the amount of logic/hardware required to perform subsequent operations is minimized for efficiency while maintaining an acceptable level of precision.

[0072] Computation logic 350 performs an integer division of the numerator and denominator. Clip logic 360 is optionally included to clip the output of computation logic 350 to be consistent with other available compression constants. Thus, using this structure, a fast, cost efficient circuit is provided for estimating lost/damaged compression constants.

[0073] The output of the circuit is preferably coupled to additional logic (not shown) which decodes using data including the recovered compression constant. In one embodiment in which the data is image data, the decoded data is used to drive a display device.

[0074] An alternate embodiment of the circuit for recovering lost/damaged compression constants is shown in FIG. 3b. The methods described herein can be implemented on a specially configured or general purpose processor system 370. Instructions are stored in the memory 390 and accessed by the processor 375 to perform many of the steps described herein. An input 380 receives the input bitstream and forwards the data to the processor 375. The output 385 outputs the data. In one embodiment, the output may consist of the decoded data, such as image data decoded once the compression constant is recovered, sufficient to drive an external device such as display 395. In another embodiment, the output 385 outputs the recovered compression constant. The recovered compression constant is then input to other circuitry (not shown) to generate the decoded data.

[0075] Although the present invention is discussed with respect to image data, the present invention may be used with any form of correlated data, including without limitation photographs or other two-dimensional static images, holograms, or other three-dimensional static images, video or other two-dimensional moving images, three-dimensional moving images, a monaural sound stream, or sound separated into a number of spatially related streams, such as stereo.

[0076] The invention has been described in conjunction with the preferred embodiment. It is evident that numerous alternatives, modifications, variations and uses will be apparent to those skilled in the art in light of the foregoing description. 

What is claimed is:
 1. A method for recovery of at least one lost/damaged compression constant for a block of encoded data, said method comprising the step of estimating a compression constant of the block using encoded data of at least one neighboring block of data and other recoverable compression constants of the block.
 2. The method as set forth in claim 1, wherein the encoded data is selected from the set comprising image data and sound data.
 3. The method as set forth in claim 1, wherein the encoded data comprises image data and each block comprises compression constants selected from the group comprising MIN, CEN, DR and MAX, wherein MIN represents a minimum data value in the block, CEN represents a central value, DR represents a dynamic range of the block and MAX represents a maximum data value in the block.
 4. The method as set forth in claim 1, wherein the compression constant is determined using a difference function between encoded data of the block of encoded data and the neighboring block of data.
 5. The method as set forth in claim 1, wherein the compression constant is determined using a least squares estimation.
 6. The method as set forth in claim 1, wherein the compression constant is determined as a value that makes a sum of decoded values of the block equal to a sum of decoded values of the neighboring block.
 7. The method as set forth in claim 3, wherein the step of estimating comprises determining MIN according to the to a formula selected from the group comprising: ${{MIN} = \frac{{2^{Q + Q^{\prime} + 1} \cdot N \cdot {MIN}^{\prime}} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}};{and}$ ${MIN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {MIN}^{\prime}} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}$

where N represents a number of neighboring encoded data to use, MIN′ represents the MIN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data, such as the encoded data, of the neighboring block.
 8. The method as set forth in claim 3, wherein the step of estimating comprises determining DR according to a formula selected from the group comprising: ${{DR} = \frac{{2^{Q + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right) \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}} + {2^{Q - Q^{\prime}} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}{\left( {{2 \cdot e_{i}^{\prime}} + 1} \right) \cdot \left( {{2 \cdot e_{i}} + 1} \right)}}}}{\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)^{2}}}\quad,{{DR} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {MIN}^{\prime}} - {2 \cdot {MIN}} + 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {e_{i}^{\prime} \cdot e_{i}} \right)}}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left( e_{i} \right)^{2}}}}\quad,{{DR} = \frac{2^{Q} \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot \left( {{2 \cdot e_{i}^{\prime}} + 1} \right)} + {2^{Q^{\prime} + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{2^{Q^{\prime}} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}\quad,\quad {and}$ ${DR} = \frac{\left( {2^{Q} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot e_{i}^{\prime}} + {\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{\left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}}$

where N represents a number of neighboring encoded data to use, MIN and MIN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.
 9. The method as set forth in claim 3, wherein the step of estimating comprises determining CEN according to a formula selected from the group comprising: $\begin{matrix} {{CEN} = \frac{{2^{Q + Q^{\prime}} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime}} \right)} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}} \\ {{CEN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}} \end{matrix}$

where N represents a number of neighboring encoded data to use, CEN′ represents the CEN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data of the neighboring block.
 10. The method as set forth in claim 1, wherein integer computations are used to recover the lost/damaged compression constant.
 11. The method as set forth in claim 3, wherein MIN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of the neighboring block.
 12. The method as set forth in claim 3, wherein DR is estimated as the value that makes a sum of decoded values of the block equal to the sum of decoded values of the neighboring block.
 13. The method as set forth in claim 3, where CEN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of the neighboring block.
 14. The method as set forth in claim 1, wherein the step of estimating is performed in accordance with an equation computed by forming the numerator and denominator of the equation in full precision, shifting off a least significant bit from the numerator and the denominator until the numerator and the denominator are less than 2^(K), and performing K-bit division, where K is a constant.
 15. A system for recovering at least one lost/damaged compression constant for a block of encoded data comprising an estimator configured to receive as input encoded data of at least one neighboring block of data and other recoverable compression constants of the block and estimate a compression constant using the input.
 16. The system as set forth in claim 15, wherein the estimator is chosen from a group comprising an estimation logic circuit, a processor, and a combination of estimation logic and a processor.
 17. The system as set forth in claim 15, wherein the encoded data is selected from the set comprising image data and sound data.
 18. The system as set forth in claim 15, wherein the encoded data comprises image data and each block comprises compression constants selected from the group comprising MIN, CEN, DR and MAX compression constants, wherein MIN represents a minimum data value in the block, DR represents a dynamic range of the block and MAX represents a maximum data value in the block.
 19. The system as set forth in claim 15, wherein the compression constant is determined using a difference function between encoded data of the block of encoded data and the neighboring block of data.
 20. The system as set forth in claim 15, wherein the compression constant is determined using a least squares estimation.
 21. The system as set forth in claim 15, wherein the compression constant is determined as a value that makes a sum of decoded values of the block equal to a sum of decoded values of the neighboring block.
 22. The system as set forth in claim 18, wherein MIN is estimated according to a formula selected from the group comprising: $\begin{matrix} {{{MIN} = \frac{{2^{Q + Q^{\prime} + 1} \cdot N \cdot {MIN}^{\prime}} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}},{and}} \\ {{MIN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {MIN}^{\prime}} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}} \end{matrix}$

where N represents a number of neighboring encoded data to use, MIN′ represents the MIN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data, such as the encoded data, of the neighboring block.
 23. The system as set forth in claim 18, wherein DR is estimated according a formula selected from the group comprising: $\begin{matrix} {{{DR} = \frac{{2^{Q + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right) \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}} + {2^{Q - Q^{\prime}} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}{\left( {{2 \cdot e_{i}^{\prime}} + 1} \right) \cdot \left( {{2 \cdot e_{i}} + 1} \right)}}}}{\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)^{2}}},} \\ {{{DR} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {MIN}^{\prime}} - {2 \cdot {MIN}} + 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {e_{i}^{\prime} \cdot e_{i}} \right)}}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left( e_{i} \right)^{2}}}},} \\ {{{DR} = \frac{2^{Q} \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot \left( {{2 \cdot e_{i}^{\prime}} + 1} \right)} + {2^{Q^{\prime} + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{2^{Q^{\prime}} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}},{and}} \\ {{DR} = \frac{\left( {2^{Q} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot e_{i}^{\prime}} + {\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{\left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}}} \end{matrix}$

where N represents a number of neighboring encoded data to use, MIN and MIN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.
 24. The system as set forth in claim 18, wherein CEN is estimated according to the following: $\begin{matrix} {{CEN} = \frac{{2^{Q + Q^{\prime}} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime}} \right)} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}} \\ {{CEN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}} \end{matrix}$

where N represents a number of neighboring encoded data to use, CEN′ represents the CEN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data of the neighboring block.
 25. The system as set forth in claim 15, wherein integer computations are used to recover the lost/damaged compression constant.
 26. The system as set forth in claim 18, wherein MIN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of a neighboring block.
 27. The system as set forth in claim 18, wherein DR is estimated as the value that makes a sum of decoded values of the block equal to a sum of decoded values of the neighboring block.
 28. The system as set forth in claim 18, wherein CEN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of a neighboring block.
 29. The system as set forth in claim 15, wherein the estimation logic comprises: full precision registers configured to store a numerator and denominator of an equation used to estimate; shift logic configured to shift off the least significant bit until the numerator and the denominator are less than 2^(K); and division logic configured to perform K-bit division, where K is a constant.
 30. A computer readable medium containing executable instructions, which, when executed in a processing system, causes the system to perform the steps for recovery of at least one lost/damaged compression constant of a block of encoded data, comprising estimating a compression constant of the block using encoded data of at least one neighboring block of data and other recoverable compression constants of the block.
 31. The computer readable medium as set forth in claim 30, wherein the encoded data is selected from the set comprising image data and sound data.
 32. The computer readable medium as set forth in claim 30, wherein the encoded data comprises compression constants selected from the group comprising MIN, CEN, DR and MAX, wherein MIN represents a minimum data value in the block, CEN represents a central value, DR represents a dynamic range of the block and MAX represents a maximum data value in the block.
 33. The computer readable medium as set forth in claim 30, wherein the compression constant is determined using a difference function between encoded data of the block of encoded data and the neighboring block of data.
 34. The computer readable medium as set forth in claim 30, wherein the compression constant is determined using a least squares estimation.
 35. The computer readable medium as set forth in claim 30, wherein the compression constant is determined as a value that makes a sum of decoded values of the block equal to a sum of decoded values of the neighboring block.
 36. The computer readable medium as set forth in claim 32, wherein estimating comprises determining MIN according to a formula selected from the group comprising: $\begin{matrix} {{{MIN} = \frac{{2^{Q + Q^{\prime} + 1} \cdot N \cdot {MIN}^{\prime}} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}},} \\ {{MIN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2\quad {MIN}^{\prime}} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}} \end{matrix}$

where N represents a number of neighboring encoded data to use, MIN′ represents the MIN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data, such as the encoded data, of the neighboring block.
 37. The computer readable medium as set forth in claim 32, wherein estimating comprises determining DR according to a formula selected from the group comprising: $\begin{matrix} {{{DR} = \frac{{2^{Q + 1} \cdot \left( {{MIN}^{\prime} - {MIN}} \right) \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}} + {2^{Q - Q^{\prime}} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}{\left( {{2 \cdot e_{i}^{\prime}} + 1} \right) \cdot \left( {{2 \cdot e_{i}} + 1} \right)}}}}{\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)^{2}}},} \\ {{{DR} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{2 \cdot {MIN}^{\prime}} - {2 \cdot {MIN}} + 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {e_{i}^{\prime} \cdot e_{i}} \right)}}}{2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left( e_{i} \right)^{2}}}},} \\ {{{DR} = \frac{2^{Q} \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot \left( {{2 \cdot e_{i}^{\prime}} + 1} \right)} + {2^{Q^{\prime} + 1}\left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{2^{Q^{\prime}} \cdot {\sum\limits_{i = 1}^{N}\left( {{2e_{i}} + 1} \right)}}},{and}} \\ {{DR} = \frac{\left( {2^{Q} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}\left\lbrack {{{DR}^{\prime} \cdot e_{i}^{\prime}} + {\left( {2^{Q^{\prime}} - 1} \right) \cdot \left( {{MIN}^{\prime} - {MIN}} \right)}} \right\rbrack}}{\left( {2^{Q^{\prime}} - 1} \right) \cdot {\sum\limits_{i = 1}^{N}e_{i}}}} \end{matrix}$

where N represents a number of neighboring encoded data to use, MIN and MIN′ respectively represent the MIN value of the block and the neighboring block, Q represents a number of quantization bits used to encode, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) and e_(i)′ respectively represent the encoded data of the block and the neighboring block and DR′ represents the dynamic range of the neighboring block.
 38. The computer readable medium as set forth in claim 32, wherein CEN is estimated according to a formula selected from the group comprising: $\begin{matrix} {{CEN} = \frac{{2^{Q + Q^{\prime}} \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime}} \right)} + {2^{Q} \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}^{\prime}} + 1} \right)}} - {2^{Q^{\prime}} \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}\left( {{2 \cdot e_{i}} + 1} \right)}}}{2^{Q + Q^{\prime} + 1} \cdot N}} \\ {{CEN} = \frac{{\left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N \cdot \left( {{2 \cdot {CEN}^{\prime}} + {DR} - {DR}^{\prime} + 1} \right)} + {2 \cdot \left( {2^{Q} - 1} \right) \cdot {DR}^{\prime} \cdot {\sum\limits_{i = 1}^{N}e_{i}^{\prime}}} - {2 \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot {DR} \cdot {\sum\limits_{i = 1}^{N}e_{i}}}}{2 \cdot \left( {2^{Q} - 1} \right) \cdot \left( {2^{Q^{\prime}} - 1} \right) \cdot N}} \end{matrix}$

where N represents a number of neighboring encoded data to use, CEN′ represents the CEN value of the neighboring block, DR and DR′ respectively represents the DR value of the block and the neighboring block, Q represents a number of quantization bits used to encode the block, Q′ represents a number of quantization bits used to encode the neighboring block, e_(i) represents the encoded data (e.g., Qcodes) and e′_(i) represents the encoded neighboring data of the neighboring block.
 39. The computer readable medium as set forth in claim 32, wherein MIN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of the neighboring block.
 40. The computer readable medium as set forth in claim 32, wherein DR is estimated as the value that makes a sum of decoded values of the block equal to a sum of decoded values of the neighboring block.
 41. The computer readable medium as set forth in claim 32, wherein CEN is estimated as the value that minimizes an average difference between a decoded value of the block and a decoded value of the neighboring block.
 42. The computer readable medium as set forth in claim 30, wherein integer computations are used to recover the lost/damaged compression constants.
 43. The computer readable medium as set forth in claim 30, wherein the equation is computed by forming the numerator and denominator of the equation in full precision registers, shifting off the least significant bit until the numerator and the denominator are less than 2^(K), and performing K-bit division, where K is a constant.
 44. An apparatus for recovering at least one lost/damaged compression constant for a block of encoded data comprising means for estimating a compression constant of the block using encoded data of at least one neighboring block of data and other recoverable compression constants of the block.
 45. The apparatus as set forth in claim 44, wherein the encoded data comprises image data and each block comprises MIN, CEN, DR and MAX compression constants selected from the group compressions, wherein MIN represents a minimum data value in the block, CEN represents a central value DR represents a dynamic range of the block and MAX represents a maximum data value in the block.
 46. The apparatus as set forth in claim 44, wherein the equation is computed by forming the numerator and denominator of the equation in full precision, shifting off the least significant bit until the numerator and the denominator are less than 2^(K), and performing K-bit division, where K is a constant. 